Challenges in Telemedicine: Even When the Road is Hard, Never Give up

Never give up.

When is Clustering Hard?

of Work in Progress PASCAL Workshop on Statistics and Optimization of Clustering, July 2005 We propose questions regarding the informational and computational limits of learning a mixture of Gaussians—the sample sizes necessary in order to recover the generating mixture with unbounded, and bounded, computation. We would like to quantify the gap between the two, i.e. the excess information requi...

Tetris is Hard, Even to Approximate

Figure 1: The tetrominoes Sq (“square”), LG (“left gun”), RG (“right gun”), LS (“left snake”), RS (“right snake”), I, and T, with each piece’s center marked. of the top row of the gameboard, and falls downward at a constant speed. As it falls, the player can rotate the piece and slide it horizontally. If, when the piece comes to rest, all gridsquares in an entire row h of the gameboard are fill...

Telemedicine in Iran: Chances and Challenges

BACKGROUND Technology is likely to transform the way care is delivered at home and in the community. Telemedicine, the child of IT and Medicine sciences is the use of telecommunication equipment and information technology to provide clinical care to individuals at distant sites and the transmission of medical and surgical information and images needed to provide that care. Undoubtedly, the adv...

When to give up on weak scale supersymmetry

Superpartner masses cannot be arbitrarily heavy if supersymmetric extensions of the standard model explain the stability of the gauge hierarchy. This ancient and hallowed motivation for weak scale supersymmetry is often quoted, yet no reliable determination of this upper limit on superpartner masses exists. In this paper we compute upper bounds on superpartner masses email address: anderson@fnt...